Search results for "Reconstruction algorithms"

showing 4 items of 4 documents

Increasing stability in the linearized inverse Schrödinger potential problem with power type nonlinearities

2022

We consider increasing stability in the inverse Schr\"{o}dinger potential problem with power type nonlinearities at a large wavenumber. Two linearization approaches, with respect to small boundary data and small potential function, are proposed and their performance on the inverse Schr\"{o}dinger potential problem is investigated. It can be observed that higher order linearization for small boundary data can provide an increasing stability for an arbitrary power type nonlinearity term if the wavenumber is chosen large. Meanwhile, linearization with respect to the potential function leads to increasing stability for a quadratic nonlinearity term, which highlights the advantage of nonlinearit…

osittaisdifferentiaaliyhtälötincreasing stabilityreconstruction algorithmsApplied Mathematicspower type nonlinearitiesinversio-ongelmatComputer Science ApplicationsTheoretical Computer ScienceMathematics - Analysis of PDEsSignal ProcessingFOS: Mathematicsinverse Schrödinger potential problemMathematical PhysicsAnalysis of PDEs (math.AP)
researchProduct

Spectral approach to D-bar problems

2017

We present the first numerical approach to D-bar problems having spectral convergence for real analytic, rapidly decreasing potentials. The proposed method starts from a formulation of the problem in terms of an integral equation that is numerically solved with Fourier techniques. The singular integrand is regularized analytically. The resulting integral equation is approximated via a discrete system that is solved with Krylov methods. As an example, the D-bar problem for the Davey-Stewartson II equations is considered. The result is used to test direct numerical solutions of the PDE.© 2017 Wiley Periodicals, Inc.

[ MATH ] Mathematics [math]Spectral approachInverse conductivity problemBar (music)General MathematicsElectrical-impedance tomographyFOS: Physical sciences2 dimensions010103 numerical & computational mathematics01 natural sciencesDiscrete systemsymbols.namesakeConvergence (routing)FOS: MathematicsApplied mathematicsUniquenessStewartson-ii equationsMathematics - Numerical Analysis0101 mathematics[MATH]Mathematics [math]Electrical impedance tomographyReconstruction algorithmsNumerical-solutionMathematicsNonlinear Sciences - Exactly Solvable and Integrable SystemsApplied MathematicsNumerical Analysis (math.NA)Integral equation010101 applied mathematicsFourier transformsymbolsUniquenessExactly Solvable and Integrable Systems (nlin.SI)
researchProduct

QR-Factorization Algorithm for Computed Tomography (CT): Comparison With FDK and Conjugate Gradient (CG) Algorithms

2018

[EN] Even though QR-factorization of the system matrix for tomographic devices has been already used for medical imaging, to date, no satisfactory solution has been found for solving large linear systems, such as those used in computed tomography (CT) (in the order of 106 equations). In CT, the Feldkamp, Davis, and Kress back projection algorithm (FDK) and iterative methods like conjugate gradient (CG) are the standard methods used for image reconstruction. As the image reconstruction problem can be modeled by a large linear system of equations, QR-factorization of the system matrix could be used to solve this system. Current advances in computer science enable the use of direct methods for…

QR-factorization algorithmComputer scienceIterative methodImage qualityLinear systemDavis and Kress (FDK)Iterative reconstruction3-D images reconstructionSystem of linear equationsAtomic and Molecular Physics and OpticsConjugate gradient (CG)FeldkampQR decompositionMatrix (mathematics)Conjugate gradient methodRadiology Nuclear Medicine and imagingMedical imagingMATEMATICA APLICADAInstrumentationAlgorithmComputed tomography (CT)Reconstruction algorithmsReconstruction toolkit (RTK)
researchProduct

Statistical Performance Analysis of a Fast Super-Resolution Technique Using Noisy Translations.

2014

It is well known that the registration process is a key step for super-resolution reconstruction. In this work, we propose to use a piezoelectric system that is easily adaptable on all microscopes and telescopes for controlling accurately their motion (down to nanometers) and therefore acquiring multiple images of the same scene at different controlled positions. Then a fast super-resolution algorithm \cite{eh01} can be used for efficient super-resolution reconstruction. In this case, the optimal use of $r^2$ images for a resolution enhancement factor $r$ is generally not enough to obtain satisfying results due to the random inaccuracy of the positioning system. Thus we propose to take seve…

FOS: Computer and information sciences[ INFO.INFO-TS ] Computer Science [cs]/Signal and Image ProcessingPositioning systemComputer scienceComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONsuper-resolution02 engineering and technologyIterative reconstructionMethodology (stat.ME)[INFO.INFO-TS]Computer Science [cs]/Signal and Image ProcessingPosition (vector)[ INFO.INFO-TI ] Computer Science [cs]/Image Processing0202 electrical engineering electronic engineering information engineeringComputer visionImage resolutionStatistics - Methodologyerror analysis[STAT.AP]Statistics [stat]/Applications [stat.AP]business.industryreconstruction algorithms[ STAT.AP ] Statistics [stat]/Applications [stat.AP]Process (computing)high-resolution imaging020206 networking & telecommunicationsFunction (mathematics)Computer Graphics and Computer-Aided DesignSuperresolutionperformance evaluation[INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV]microscopy020201 artificial intelligence & image processingAlgorithm designArtificial intelligencebusinessSoftwareIEEE transactions on image processing : a publication of the IEEE Signal Processing Society
researchProduct